Accepting Pure Grammars and Systems

We consider several types of pure grammars and systems as language acceptors and compare them to their generating counterparts. In contrast with the case (considered in earlier papers of the authors) encountered when admitting nonterminals in these classical string rewriting mechanisms , we get incomparability results between language families generated and accepted by numerous types of pure grammars and systems. Interestingly , there are also cases when we get inclusion results which are rather seldom in the theory of pure grammars. Furthermore, we consider several concepts of determinism of Linden-mayer systems both in generating and in accepting case. Partially supported by Deutsche Forschungsgemeinschaft grant DFG La 618/3-1/2.